Sparse difference resultant
نویسندگان
چکیده
منابع مشابه
Linear sparse differential resultant formulas
Let P be a system of n linear nonhomogeneous generic sparse ordinary differential polynomials in n − 1 differential indeterminates. In this paper, differential resultant formulas are presented to compute, whenever it exists, the sparse differential resultant ∂Res(P) introduced by Li, Gao and Yuan in [12], as the determinant of the coefficient matrix of an appropriate set of derivatives of diffe...
متن کاملHybrid Sparse Resultant Matrices for Bivariate Polynomials
We study systems of three bivariate polynomials whose Newton polygons are scaled copies of a single polygon. Our main contribution is to construct square resultant matrices, which are submatrices of those introduced by Cattani et al. (1998), and whose determinants are nontrivial multiples of the sparse (or toric) resultant. The matrix is hybrid in that it contains a submatrix of Sylvester type ...
متن کاملA Practical Method for the Sparse Resultant ( Extended
We propose an eecient method for computing the sparse resultant of a system of n + 1 polynomial equations in n unknowns. Our approach improves upon CE93] and constructs a smaller matrix whose determinant is a non-zero multiple of the resultant and from which the latter is easily recovered. For certain classes of systems, it attains optimality by expressing the resultant as a single determinant....
متن کاملAn E cient Algorithm for the Sparse Mixed Resultant
We propose a compact formula for the mixed resultant of a system of n+1 sparse Laurent polynomials in n variables. Our approach is conceptually simple and geometric, in that it applies a mixed subdivision to the Minkowski Sum of the input Newton polytopes. It constructs a matrix whose determinant is a non-zero multiple of the resultant so that the latter can be de ned as the GCD of n + 1 such d...
متن کاملAn Efficient Algorithm for the Sparse Mixed Resultant
We propose a compact formula for the mixed resultant of a system of n+1 sparse Laurent polynomials in n variables. Our approach is conceptually simple and geometric, in that it applies a mixed subdivision to the Minkowski Sum of the input Newton polytopes. It constructs a matrix whose determinant is a non-zero multiple of the resultant so that the latter can be deened as the GCD of n + 1 such d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2015
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2014.09.016